Three-step iterative methods with eighth-order convergence for solving nonlinear equations

نویسنده

  • M. Matinfar
چکیده

A family of eighth-order iterative methods for solution of nonlinear equations is presented. We propose an optimal three-step method with eight-order convergence for finding the simple roots of nonlinear equations by Hermite interpolation method. Per iteration of this method requires two evaluations of the function and two evaluations of its first derivative, which implies that the efficiency index of the developed methods is 1.682. Some numerical examples illustrate that the algorithms are more efficient and performs better than the other methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A SIXTH ORDER METHOD FOR SOLVING NONLINEAR EQUATIONS

In this paper, we present a new iterative method with order of convergence eighth for solving nonlinear equations. Periteration this method requires three evaluations of the function and one evaluation of its first derivative. A general error analysis providing the eighth order of convergence is given. Several numerical examples are given to illustrate the efficiency and performance of the new ...

متن کامل

AN ITERATIVE METHOD WITH SIX-ORDER CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS

Modification of Newtons method with higher-order convergence is presented. The modification of Newtons method is based on Frontinis three-order method. The new method requires two-step per iteration. Analysis of convergence demonstrates that the order of convergence is 6. Some numerical examples illustrate that the algorithm is more efficient and performs better than classical Newtons method and ...

متن کامل

New iterative methods with seventh-order convergence for solving nonlinear equations

In this paper, seventh-order iterative methods for the solution ofnonlinear equations are presented. The new iterative methods are developed byusing weight function method and using an approximation for the last derivative,which reduces the required number of functional evaluations per step. Severalexamples are given to illustrate the eciency and the performance of the newiterative methods.

متن کامل

Solving systems of nonlinear equations using decomposition technique

A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...

متن کامل

A NEW TWO STEP CLASS OF METHODS WITH MEMORY FOR SOLVING NONLINEAR EQUATIONS WITH HIGH EFFICIENCY INDEX

It is attempted to extend a two-step without memory method to it's with memory. Then, a new two-step derivative free class of without memory methods, requiring three function evaluations per step, is suggested by using a convenient weight function for solving nonlinear equations. Eventually, we obtain a new class of methods by employing a self-accelerating parameter calculated in each iterative...

متن کامل

Solving System of Nonlinear Equations by using a New Three-Step Method

In this paper‎, ‎we suggest a fifth order convergence three-step method for solving system of nonlinear equations‎. ‎Each iteration of the method requires two function evaluations‎, ‎two first Fr'{e}chet derivative evaluations and two matrix inversions‎. ‎Hence‎, ‎the efficiency index is $5^{1/({2n+4n^{2}+frac{4}{3}n^{3}})}$‎, ‎which is better than that of other three-step methods‎. ‎The advant...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013